Comparing O set Curve Approximation
نویسندگان
چکیده
OOset curves have diverse engineering applications , which have consequently motivated extensive research concerning various ooset techniques. OOset research in the early 1980s focused on approximation techniques to solve immediate application problems in practice. This trend continued until 1988, when Hoschek 1, 2] applied non-linear optimization techniques to the ooset approximation problem. Since then, it has become quite diicult to improve the state-of-the-art of ooset approximation. OOset research in the 1990s has been more theoretical. The foundational work of Farouki and Nee 3] clariied the fundamental diiculty of exact ooset computation. Farouki and Sakkalis 4] suggested the Pythagorean Hodograph curves which allow simple rational representation of their exact ooset curves. Although many useful plane curves such as conics do not belong to this class, the Pythagorean Hodo-graph curves may have much potential in practice, especially when they are used for ooset approximation. In a recent paper 5] on ooset curve approximation , the authors suggested a new approach based on approximating the ooset circle, instead of approximating the ooset curve itself. To demonstrate the eeectiveness of this approach, we have made extensive comparisons with previous methods. To our surprise, the simple method of Tiller and Hanson 6] outperforms all the other methods for oosetting (piecewise) quadratic curves, even though its performance is not as good for high degree curves. The experimental results have revealed other interesting facts, too. If these details had been reported several years ago, we believe, ooset approximation research might have developed somewhat diierently. This paper is intended to ll in an important gap in the literature. Qualitative as well as quantitative comparisons are conducted employing a whole variety of contemporary ooset approximation methods for freeform curves in the plane. The eeciency of the ooset approximation is measured in terms of the number of control points generated while the approximations are made within a prescribed tolerance. Given a regular parametric curve, C(t) = (x(t); y(t)), in the plane, its ooset curve C d (t) by a constant radius d, is deened by: C d (t) = C(t) + d N (t); (1) where N (t) is the unit normal vector of C(t): N (t) = (y 0 (t); ?x 0 (t)) p x 0 (t) 2 + y 0 (t) 2 : (2) The regularity condition of C(t) guarantees that (x 0 (t); y 0 (t)) 6 = (0; 0) and N (t) is well deened on …
منابع مشابه
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملApproximating hitting sets of axis-parallel rectangles intersecting a monotone curve
In this note, we present a simple combinatorial factor 6 algorithm for approximating the minimum hitting set of a family R = {R1, . . . ,Rn} of axis-parallel rectangles in the plane such that there exists an axis-monotone curve γ that intersects each rectangle in the family. The quality of the hitting set is shown by comparing it to the size of a packing (set of pairwise non-intersecting rectan...
متن کاملError bounded variable distance offset operator for free form curves and surfaces
Most o set approximation algorithms for freeform curves and surfaces may be classi ed into two main groups The rst approximates the curve using simple primitives such as piecewise arcs and lines and then calculates the exact o set operator to this approximation The second o sets the control polygon mesh and then attempts to estimate the error of the approximated o set over a region Most of the ...
متن کاملHermite approximation for offset curve computation
The present paper proposes a new method for calculating the Gcontinuous o set curve to a cubic B ezier curve, based on the Hermite approximation technique. This method is improved by preliminary curvature estimation and is intended for use in cpu-time sensitive CAGD applications.
متن کاملEllipse Fitting Using Orthogonal Hyperbolae and Stirling's Oval
Two methods for approximating the normal distance to an ellipse using a) its orthogonal hyperbolae, and b) Stirling’s oval are described. Analysis with a set of quantitative set of measures shows that the former provides an accurate approximation with little irregularities or biases. Its suitability is evaluated by comparing several approximations as error of fit functions and applying them to ...
متن کاملSignal detection Using Rational Function Curve Fitting
In this manuscript, we proposed a new scheme in communication signal detection which is respect to the curve shape of received signal and based on the extraction of curve fitting (CF) features. This feature extraction technique is proposed for signal data classification in receiver. The proposed scheme is based on curve fitting and approximation of rational fraction coefficients. For each symbo...
متن کامل